perm filename SUAI.TXT[NET,MRC]1 blob
sn#336682 filedate 1978-02-21 generic text, type T, neo UTF8
(SU-AI) STANFORD UNIVERSITY
ARTIFICIAL INTELLIGENCE LABORATORY
(FUNCTION)
SERVER COMPUTER: PDP-10 HOST ADDR 11 IMP 11/HOST 0
Primarily an artificial intelligence research facility.
(ADDRESS)
Stanford University
Artificial Intelligence Laboratory
Stanford, California 94305
(PERSONNEL)
DIRECTOR
John McCarthy (JMC@SU-AI) (415) 497-4430
LIAISON
Mark Crispin (MRC@SU-AI) (415) 497-4971
ACCOUNTS
Les Earnest (LES@SU-AI) (415) 497-4202
SOFTWARE-CONTACT
Mark Crispin (MRC@SU-AI) (415) 497-4971
HARDWARE-CONTACT
Edward F. Panofsky (TED@SU-AI) (415) 497-4971
(ACCOUNTING)
There is no guest account at SU-AI. Network users without accounts
who want to use this system can use the MAIL command without login to
communicate with us, as explained below. Since the system is
chronically overloaded, outside accounts are provided only for
projects in which SU-AI has a direct interest.
Your request should cover the following points:
1. A brief description of your project and its goals,
2. Expected duration of the project,
3. Proposed account designation (e.g. "1,XYZ",
where both the project designation, "1" in the example,
and programmer initials, "XYZ", may be up to 3 letters).
NOTE: To check whether your initials have been used,
give the system command "FINGER XYZ". If the
initials are not in use, this will say "UNKNOWN".
4. Your network mail or ordinary mail address.
(SERVICE-SCHEDULE)
SU-AI is available to users 24 hours daily except for
occasional maintenance weekdays between 1700-1900 PST.
TYPICAL LOAD = 50 users
MAX. NO. USERS = 64 combined local and network
NO. NETWORK SLOTS - 20 pseudo-terminals
(LOGIN)
TELNET INFO:
. Appropriate transmission mode = character-at-a-time
. Appropriate echo mode = Full-duplex
. Monitor commands to declare terminal type:
[.]tty <SP> dm <SP> SCREEN-HEIGHT <CR>
Declare the terminal to be a Datamedia 2500 display terminal. The
screen height defaults to 24 lines.
[.]tty <SP> dm128 <SP> SCREEN-HEIGHT
Declare the terminal to be a Datamedia display with the full SAIL
extended ASCII character set.
[.]tty <SP> echo <CR>
The system is to echo user type-in.
[.]tty <SP> no <SP> echo <CR>
The system is not to echo user type-in.
[.]tty <SP> tabs <CR>
The terminal has hardware tabs every 8 print positions.
[.]tty <SP> no <SP> tabs <CR>
The system converts tabs to the correct number of spaces.
[.]tty <SP> fill <CR>
The system should insert fill characters after carriage returns.
[.]tty <SP> no <SP> fill <CR>
The system should not send fill characters.
[.]tty <SP> full <CR>
The system should accept and output lower case as lower case.
[.]tty <SP> no <SP> full <CR>
The system should convert lower case to upper case.
[.]tty <SP> arrow <CR>
The system should print control characters as uparrow followed by
the character plus 100 (octal) in the usual PDP-10 convention.
[.]tty <SP> no <SP> arrow <CR>
The system should output control codes as themselves.
Initial settings for network connections:
ECHO, NO TABS, NO FILL, FULL, ARROW
(NOTE: the echoing state can be controlled by TELNET
control codes as well as by this command. The TELNET
protocol requires an initial assumption of half-duplex
but we switch to full duplex if possible.)
LOGIN:
Connect to SU-AI, then type:
[SU A.I. Lab KL-10]
[.]login <SP> PRJ,PRG <CR>
(where PRJ = Project No., and PRG = Userid,
each limited to 3 letters)
[Password=] PASSWORD <CR>
[Job NN Stanford SYSTEM VERSION]
[TODAY'S DATE - TIME]
[...MESSAGES OF THE DAY...]
[Exit]
[↑C]
[.]
SUBSYSTEM INTERRUPT = CONTROL-C CONTROL-C. A single CONTROL-C
returns to command level when the user program requests typein.
SUBSYSTEM CONTINUE = [.]continue <CR>
(LOGOUT)
LOGOUT:
CONTROL-C (which returns you to EXEC)
[.]kjob <CR>
[Job NN PRJ,PRJ Logged off TTY NNN TIME DATE]
[n.nn hours, console time]
[N.NN minutes, cpu time]
[N.NN Pages average core]
[Kjob]
AUTOLOGOUT:
Jobs will be logged out after one-half hour idle (10 AM - 6 PM)
or one hour idle (6 PM - 10 AM).
Breaking the network connection detaches the job, which will be
autologged out as if idle if not attached back.
(CONTROL-CHARACTERS)
A few control characters are listed below:
Delete last character RUBOUT
Delete command or line CONTROL-U
Prompt or help program dependent
(HELP)
To get help online, type: [.]help <CR>
(NETWORK-COMMANDS)
(LIST-ACTIVE-USERS)
[.]who <CR> gives job-status information (jobname,
size, queue, ...)
[.]finger <CR> gives human-oriented information (full
name, physical location, ...)
(NETWORK-STATUS)
Login and type:
[.]r <SP> impstat <CR>
To see the status of hosts on the ARPAnet type:
[.]r <SP> hostat <CR>
(LINK-TO-ACTIVE-USERS)
To send a message to a logged-in user, type:
[.]send <SP> RECIPIENT-ID <SP>...MESSAGE...<CR>
for a one-line message, or:
[.]send <SP> RECIPIENT-ID <CR>
[type message followed by <CTRL>Z]
...MESSAGE...<CR>
...MORE MESSAGE...CONTROL-Z
For a multi-line message. "ID" may be the
recipient's programmer ID or real name.
To link to another terminal, type:
[.]talk <SP> RECEPIENT-ID <CR>
but it is better to use SEND and let the other
person link back.
(SEND-MAIL)
[.]mail <SP> RECIPIENT-ID <SP>...MESSAGE...<CR>
for a one-line message, or:
[.]mail <SP> RECIPIENT-ID <CR>
[type message followed by <CTRL>Z]
...MESSAGE...<CR>
...MESSAGE...CONTROL-Z
for a multi-line message.
To send a message to a logged-in user's terminal immediately, use the
command SEND in the formats above instead of MAIL.
(RETRIEVE-MESSAGE)
Login, and type:
[.]rcv <CR>
(TALK-TO-OPERATOR)
There is no operator on this system.
(PROTOCOLS)
SU-AI has among the most extensive user and server protocols
offered to users on the ARPAnet.
(SERVER)
Network Server Protocols currently implemented are:
(note all socket numbers are octal)
1. TELNET (old on socket 1, new on socket 27)
2. FTP (socket 3)
3. SUPDUP (socket 137)
4. RS EXEC subset (socket 365)
5. Time Server (socket 45)
6. ECHO (socket 7)
7. DISCARD (socket 11)
8. SYSTAT (socket 13)
9. Day/time string (socket 15)
10. Network status (socket 17)
11. Text (socket 21)
12. FINGER (socket 117)
13. Load average (socket 371)
(USER)
User Protocols currently implemented are:
1. TELNET (old protocol)
[.]otn <SP> HOST-NAME (or OCTAL-HOST-NUMBER) <CR>
2. TELNET (new protocol)
[.]telnet <SP> HOST-NAME (or OCTAL-HOST-NUMBER) <CR>
(tn is legal as an abbreviation)
3. SUPDUP
[.]supdup <SP> HOST-NAME
(sd is legal as an abbreviation)
4. FTP
[.]ftp <SP> HOST-NAME (or DECIMAL-HOST-NUMBER) <CR>
5. FINGER
[.]finger <SP> USER-ID % HOST-NAME <CR>
6. MAIL
[.]mail <SP> USER-ID % HOST-NAME <CR>
7. SEND
[.]send <SP> USER-ID % HOST-NAME <CR>
8. TIMES (network standard time)
[.]r <SP> times <CR>
9. WHO (network who-is-on)
[.]r <SP> netwho; HOST-NAME (or USER-ID % HOST-NAME) <CR>
10. TALK (network link)
[.]r <SP> talk; USER-ID % HOST-NAME <CR>
11. HOSTAT (host status)
[.]r <SP> hostat <CR>
(NCP-INTERFACE-FROM-LOCAL-PROGRAMS) See UUO manual.
(HARDWARE)
(COMPUTER)
TYPE CORE AMOUNT CORE SPEED WORD LENGTH
KL10, KA10 317K 1-2 microsec. 36 bit
& PDP-6 shared
PDP-11/45 200K 1 microsec. 16 bit
& SPS-41 shared
(PERIPHERALS)
HOW MANY TYPE MAKE MODEL
DISKS
6 AMPEX DDM331
TAPES
2 7 track DEC 545
4 DECtape DEC 555
PRINTERS
1 lineprinter DEC 646
1 raster Xerox XGP
1 plotter Calcomp 563
OTHER
4 TV cameras COHU and Sierra
2 mechanical arm Stanford
1 vending Rowe 147
machine
1 phone dialer Western Elec. 801C
1 robot cart Stanford
controller
1 memory mappi- Stanford
plexor
(TERMINALS)
HOW MANY TYPE MAKE MODEL
58 TV display Data Disc* TDS
20 TV display Datamedia 2500A
6 vector display III
3 remote display IMLAC PDS-1
2 typewriter Teletype 33
1 typewriter DEC LA-36
5 typewriter Texas Inst. 725
* Data Disc displays can view computer-generated gray-scale
images. The Data Disc controller is connected through a
video switch built at Stanford to terminals consisting of
Miratel TV monitors and Microswitch keyboards.
(OPERATING-SYSTEM)
The SU-AI time-sharing system is a modification and extension of an
early DEC system and is to a degree compatible with TOPS-10.
(USER-PROGRAMS)
(E)
TYPE: Display text editor
CONTACT: Arthur Samuel (ALS@SU-AI) (415) 497-3330
DESCRIPTION: E is a text editor used from local display terminals
at Stanford. It uses random access, edit-in-place operation, so
small changes to large files are done very much faster than in
recopying editors such as SOS or TECO. Changes to the text within a
line are made using the line editing facilities in the timesharing
monitor, which gives fast response to editing commands since E need
not be swapped in and scheduled for these commands.
ACCESS:
[.]etv FILENAME <CR>
NETWORK USE PARAMETERS:
Although E can be run from a terminal which is not a
local Stanford display, it is not designed for such
use; many of its facilities are not available in that
mode of operation.
Datamedia 2500 terminals (and SUPDUP terminals) are
"local Stanford displays" and enjoy E's full facilities.
DOCUMENTATION:
1. Online: E.ALS[UP,DOC]
(FAIL)
TYPE: PDP-10 Assembler
CONTACT: Jeff Rubin (JBR@SU-AI) (415) 497-4971
DESCRITION: FAIL is an extremely fast D-10 assembler, 5 times faster
than MACRO-10. It achieves its speed by running in one pass instead
of the usual two, at a cost of fairly large core requirements and
somewhat more work required of the loader. (It is compatible with
DEC's LOADER and LINK-10.)
ACCESS:
[.]r <SP> fail <CR>
DOCUMENTATION:
1. FAIL Manual, Stanford A.I. Memo 226, Stanford
Artificial Intelligence Lab., Stanford Univ.,
Calif., 1974. (Available online as FAIL.REG[AIM,DOC]
It is available in hardcopy from:
National Technical Information Service
US Department of Commerce
5285 Port Royal Road
Springfield, VA 22161
as Stanford report STAN-CS-74-407, AIM-226
(FASBOL)
TYPE: SNOBOL compiler
CONTACT: Mike Clancy (MJC@SU-AI) (415) 497-4971
DESCRIPTION: FASBOL is a compiler for a dialect of SNOBOL 4, the
string processing language developed at Bell Labs.
ACCESS:
[.]r <SP> fasbol <CR>
DOCUMENTATION:
1. Griswold, R. et al, The SNOBOL 4 Language,
Prentice-Hall, 1971.
2. Online: FASBOL.MJC[UP,DOC]
(FOL)
TYPE: Proof Checker for First-Order Logic
CONTACT: Richard Weyhrauch (RWW@SU-AI) (415) 497-4971
DESCRIPTION: The interactive proof checker FOL (First Order Logic)
implements a version of the system of natural deduction described by
Prawitz, augmented in the following ways: 1. It is a many-sorted
first-order logic, and a partial order over sorts may be declared,
reducing the size of formulas; 2. purely propositional deductions
can be made in a single step; 3. the truth values of assertions
involving numerical and LISP constants can be derived by computation;
4. there is a limited ability to make metamathematical arguments; and
5. there are many operational conveniences.
The goal of FOL is to use formal proof techniques as practical tools
for checking proofs in pure mathematics and proofs of the correctness
of programs. It is also intended to be used as a research tool in
modeling common-sense reasoning in the representation theory of
artificial intelligence.
ACCESS:
[.]r <SP> fol <CR>
DOCUMENTATION:
1. FOL Manual, AI Memo 235, Stanford Artificial
Intelligence Lab., Stanford Univ. (Available
from the AI Laboratory in hardcopy or microfiche.
not available online.)
(GEOMED)
TYPE: GEOMetric EDitor
CONTACT: Bruce Baumgart (BGB@SU-AI) (415) 497-4971
DESCRIPTION: GEOMED is a geometric modeling system, which allows
the user to define and manipulate polyhedra. The GEOMED manipulation
routines are available both as an interactive 3-D drawing program
using local Stanford vector display terminals, and as a subroutine
package usable in SAIL or LISP programs. With GEOMED, arbitrary
polyhedra can be constructed, moved about, and viewed in perspective
with hidden lines eliminated. Also, camera and image models are
provided, so that simulators relevant to computer vision, problem
solving, and animation may be constructed.
ACCESS:
[.]r <SP> geomed <CR>
The interactive GEOMED program is usable only from a
vector display terminal. GEOMED has been run
experimentally through the Network Graphics Protocol.
The subroutine packages for SAIL and LISP programs,
GEOMES and GEOMEL, are in files in the [GEM,HE] directory.
DOCUMENTATION:
1. GEOMED Manual, Stanford AI Memo 232, Stanford
Artificial Intelligence Lab., Stanford Univ.,
Calif. (Available in microfiche from SU-AI or
in hardcopy from NTIS; not available online).
2. Baumgart, B. G. Geometric Modeling for Computer
Vision, Stanford AI Memo 249, Stanford Artificial
Intelligence Lab., Stanford Univ., Calif.
(Availability as above)
3. GEOMED.BGB[UP,DOC]
(HOT)
TYPE: Information retrieval system
CONTACT: Martin Frost (ME@SU-AI) (415) 497-4971
DESCRIPTION: HOT types news stories from the Associated Press and
New York Times news wires as they come in.
ACCESS:
[.]hot <CR>
DOCUMENTATION:
1. Online: NS.ME[UP,DOC]
(LCF)
TYPE: Proof Checker (Logic of Computable Functions)
CONTACT: Richard Weyhrauch (RWW@SU-AI) (415) 497-4971
DESCRIPTION: LCF is a proof-checking program for a logic of
computable functions proposed by Dana Scott in 1969. The
proof-checking program is designed to allow the user interactively to
generate formal proofs about computable functions and functionals
over a variety of domains, including those of interest to the
computer scientist - for example integers, lists and computer
programs and their semantics. The user's task is alleviated by two
features: a subgoaling facility and a powerful simplification
mechansim. Applications include proofs of program correctness and in
particular of compiler correctness.
ACCESS:
[.]r <SP> lcf <CR>
DOCUMENTATION:
1. LCF Manual, Stanford AI Memo 169, Stanford
Artificial Intelligence Lab., Stanford Univ.,
Calif.
2. Online: LCFMAN.RGM[AIM,DOC]
(LISP)
TYPE: List processing language
CONTACT: Dick Gabriel (RPG@SU-AI) (415) 497-4971
DESCRIPTION: We have several flavors of LISP. The basic, vanilla
LISP is called LISP 1.6, and is comparable to LISP 1.5. A version
with roughly the same capabilities but M-expression (ALGOL-like)
syntax is called MLISP. An extension of MLISP with extensibility,
pattern matching, and backtracking features is called MLISP2.
Another M-expression dialect is RLISP. We also have the U.C. Irvine
extension of LISP 1.6, called ILISP, with an editor and superior
debugging facilities. In addition we have MIT's version of LISP
(MACLISP), MICROPLANNER (PLNR), and CONNIVER (CNVR) languages.
MACLISP is currently the only LISP which is maintained.
ACCESS:
Interpreter Compiler
LISP 1.6: [.]r <SP> lisp <CR> [.]r <SP> complr <CR>
MLISP: [.]r <SP> mlisp <CR> [.]r <SP> mlispc <CR>
MLISP2: [.]r <SP> mlisp2 <CR>
RLISP: [.]r <SP> rlisp <CR>
ILISP: [.]r <SP> il <CR> [.]r <SP> ic <CR>
MACLISP: [.]r <SP> maclsp <CR> [.]r <SP> ncomplr <CR>
UPLANNER: [.]r <SP> plnr <CR>
CONNIVER: [.]r <SP> icnvr <CR>
DOCUMENTATION:
LISP 1.6: LISP.WD[S,DOC] SAILON 28
MLISP: MLISP.DAV[AIM,DOC] AI Memo 135
MLISP2: MLISP2.DAV[AIM,DOC] AI Memo 195
RLISP: RLISP.ACH[S,DOC] SAILON 62
ILISP: IL.TVR[UP,DOC] (from UCI)
MACLISP: MACLSP.DM[UP,DOC] (from MIT)
PLANNER: PLNR.RPO[UP,DOC] (from MIT)
PLNR.BGB[S,DOC] SAILON 67
CONNIVER: CNVR.MAN[UP,DOC] (from MIT)
(MIDAS)
TYPE: Assembler
CONTACT: Mark Crispin (MRC@SU-AI) (415) 497-4971
DESCRIPTION: MIDAS is the ITS macro-assembler, modified for SU-AI's
operating system. The language itself is compatable with the MIT
version.
ACCESS:
[.]r <SP> midas <CR>
DOCUMENTATION:
1. Online: MIDAS.MRC[UP,DOC]
(NS)
TYPE: Information retrieval system
CONTACT: Martin Frost (ME@SU-AI) (415) 497-4971
DESCRIPTION: NS retrieves news stories from the Associated Press
and New York Times news wires based on arbitrary keyword selection.
About 2 weeks worth of back news is available online.
ACCESS:
[.]ns <CR>
DOCUMENTATION:
1. Online: NS.ME[S,DOC]
(PROVER)
TYPE: Theorem Prover
CONTACT: David Luckham (DCL@SU-AI) (415) 497-4971
DESCRIPTION: PROVER is an implementation of a resolution-based
first-order theorem prover. The basic philosophy and structure of
this program were described in "An Interactive Theorem-proving
Program", by Allen and Luckham, MIT (1970). The user is supplied
with a reasonably standard mathematical notation for specifying the
problem and a simple language for describing the strategies to guide
the proof. The user may interrupt the proof search at any time and
use the online facilities to further guide the prover.
The online editor allows the user to associate names with collections
of deductions. The collecting can be done by pattern matching or by
explicit user-selection. These collections can then be used by:
commands to modify the current set of deductions (delete, simplify
by...); rules of inference (resolution, or paramodulation); or by
commands to initiate sub-proofs.
ACCESS:
[.]r <SP> prover <CR>
DOCUMENTATION:
1. PROVER Manual, Operating Note 73, Stanford Artificial
Intelligence Lab., Stanford Univ.
(PUB)
TYPE: Text formatter
CONTACT: Les Earnest (LES@SU-AI) (415) 497-4202
DESCRIPTION: A versatile text justifier. Automatic table of
contents and index generation. Multiple columns, all the better
things. Program is slow and uses large core images to boot. But
powerful.
ACCESS:
[.]pub <SP> FILENAME <CR>
NETWORK USE PARAMETERS:
Inquiries about using PUB should be directed to
TESLER@PARC-MAXC.
DOCUMENTATION:
1. PUB.TES[S,DOC] (SAILON 70)
1. PUB.UPD[S,DOC]
(SAIL)
TYPE: Extended-ALGOL language
CONTACT: Les Earnest (LES@SU-AI) (415) 497-4971
DESCRIPTION: SAIL is a superset of ALGOL 60. It also includes
coroutine features, machine language capability, records and
references, and other bells and whistles too numerous to mention.
ACCESS:
To run the SAIL compiler, type:
[.]r <SP> sail <CR>
See the SAIL manual, A.I. Memo 289, for complete
information.
DOCUMENTATION:
1. SAIL Manual, Stanford A.I. Memo 289, Stanford
Artificial Intelligence Lab., Stanford Univ.,
Calif.
2. SAIL Tutorial, AIM-290, Stanford Artificial
Intelligence Lab., Stanford Univ., Calif.
Available in hardcopy from:
National Technical Information Service,
US Department of Commerce
5285 Port Royal Road
Springfiel, VA 22161
as Stanford reports STAN-CS-76-574 and STAN-CS-76-575.
3. Online: SAIL.JFR[AIM,DOC].
Update: SAIL.UPD[AIM,DOC].
WARNING: the SAIL manual is a very long document.
(SPELL)
TYPE: Spelling Checker and Corrector
CONTACT: Ralph Gorin (REG@SU-AI) (415) 497-1360
DESCRIPTION: Checks a text file against a standard or user-supplied
dictionary, correcting errors (with a little help from the user).
ACCESS:
[.]r <SP> spell <CR>
DOCUMENTATION:
1. Online: SPELL.REG[UP,DOC]
(SOS)
TYPE: Text editor
CONTACT: Les Earnest (LES@SU-AI) (415) 497-4202
DESCRIPTION: SOS is a Teletype-oriented (i.e. non-display),
line-oriented text editor. Similar to DEC's LINED but better.
ACCESS:
[.]r <SP> sos <CR>
or
[.]edit <SP> FILENAME <CR>
DOCUMENTATION:
1. SOS.LES[S,DOC] SAILON 50
(INTERESTS)
Current interests of the Stanford Artificial Intelligence Lab. center
around research on artificial intelligence, including computer
vision, hand-eye systems, natural language understanding, program
verification, and automatic programming. Also of interest are
mathematical theory of computation and computer music.
(DOCUMENTATION)
(REFERENCES)
The following bibliographies are available online at SU-AI:
SAILON[BIB,DOC] Annotated bibliography of SU-AI
operating notes
AIMS[BIB,DOC] Abstract of recent SU-AI research memos
AIMS.OLD[BIB,DOC] Same as above, but older
FILMS[BIB,DOC] Abstracts of SU-AI film reports
THESES[BIB,DOC] List of theses published by SU-AI
PUBS[BIB,DOC] External articles/books by SU-AI staff
PUBS.OLD[BIB,DOC] Same as above, but older
HAND.EYE[BIB,DOC] Bibliography of articles dealing with
hand-eye research and related robotics
work.
MTCBIB[BIB,DOC] Bibliography of articles dealing with
mathematical theory of computation
The following file directories contain complete documents:
[S,DOC] Text of SU-AI operating notes
[AIM,DOC] Text of some documents in AIMS[BIB,DOC]
[UP,DOC] Text of informal program documentation
The main sources of system documentation are the Monitor Command
Manual, SAILON 54.5, and the UUO Manual, SAILON 55.4. These are
available to users from Documentation Services at the laboratory, or
online as:
MONCOM.BH[S,DOC]
UUO.ME[S,DOC].
NOTE: These are very long files!
To find online documentation about a particular program, type:
[.]help PROGRAM-NAME <CR>
This write-up for the ARPANET Resource Handbook is found online as
RESO.LES[UP,DOC].
Other useful features:
Type: [.] di [PRJ,PRG] to list a directory
Type: [.] type FILENAME[PRJ,PRG] to type out a file
NOTE: These commands can be given when not logged in.
(ORDER-INFORMATION)
Some AI memos and program documentation are available from
Documentation Services
Artificial Intelligence Lab.
Stanford University
Stanford, Calif. 94305
or by network mail to PAT@SU-AI.
Documents which are out of print locally may be obtained from:
National Technical Information Service
US Department of Commerce
5285 Port Royal Road
Springfield, VA 22161
Information on getting memos from NTIS is available from
Documentation Services, as above.
Recent AI Memos are available in microfiche format.